Weighted Oblique Decision Trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Induction of Oblique Decision Trees

This paper introduces a randomized technique for partitioning examples using oblique hyperplanes. Standard decision tree techniques , such as ID3 and its descendants, partition a set of points with axis-parallel hyper-planes. Our method, by contrast, attempts to nd hyperplanes at any orientation. The purpose of this more general technique is to nd smaller but equally accurate decision trees tha...

متن کامل

Decision Forests with Oblique Decision Trees

Ensemble learning schemes have shown impressive increases in prediction accuracy over single model schemes. We introduce a new decision forest learning scheme, whose base learners are Minimum Message Length (MML) oblique decision trees. Unlike other tree inference algorithms,MMLoblique decision tree learning does not over-grow the inferred trees. The resultant trees thus tend to be shallow and ...

متن کامل

Weighted Decision Trees

While decision tree compilation is a promising way to carry out guard tests eeciently, the methods given in the literature do not take into account either the execution characteristics of the program or the machine-level tradeoos between diierent ways to implement branches. These methods therefore ooer little or no guidance for the implementor with regard to how decision trees are to be realize...

متن کامل

Oblique Multicategory Decision Trees Using Nonlinear Programming

I of decision trees is a popular and effective method for solving classification problems in data-mining applications. This paper presents a new algorithm for multi-category decision tree induction based on nonlinear programming. This algorithm, termed OC-SEP (Oblique Category SEParation), combines the advantages of several other methods and shows improved generalization performance on a collec...

متن کامل

MML Inference of Oblique Decision Trees

We propose a multivariate decision tree inference scheme by using the minimum message length (MML) principle (Wallace and Boulton, 1968; Wallace and Dowe, 1999). The scheme uses MML coding as an objective (goodness-of-fit) function on model selection and searches with a simple evolution strategy. We test our multivariate tree inference scheme on UCI machine learning repository data sets and com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence

سال: 2019

ISSN: 2374-3468,2159-5399

DOI: 10.1609/aaai.v33i01.33015621